Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity
نویسندگان
چکیده
We look at probabilistic logic programs as a specification language for probabilistic models, and study their interpretation and complexity. Acyclic programs specify Bayesian networks, and, depending on constraints on logical atoms, their inferential complexity reaches complexity classes #P, #NP, and even #EXP. We also investigate (cyclic) stratified probabilistic logic programs, showing that they have the same complexity as acyclic probabilistic logic programs, and that they can be depicted using chain graphs.
منابع مشابه
On the Relationship between Logical Bayesian Networks and Probabilistic Logic Programming Based on the Distribution Semantics
A significant part of current research on ILP deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One class of languages are those that extend probabilistic models with elements of logic, such as in the language of ...
متن کاملOn the Semantics and Complexity of Probabilistic Logic Programs
We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato’s distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the “credal semantics”) produces sets...
متن کاملThe Structure and Complexity of Credal Semantics
A flexible semantics has been proposed by Lukasiewicz for probabilistic logic programs where we have a normal logic program augmented with a set of independent probabilistic facts. That semantics, which we call credal semantics, is the set of all probability measures (over stable models) that are consistent with a total choice of probabilistic facts. When each total choice produces a definite p...
متن کاملThe Well-Founded Semantics of Cyclic Probabilistic Logic Programs: Meaning and Complexity
This paper investigates the properties of cyclic probabilistic normal logic programs, consisting of rules and a set of independent probabilistic facts, under the well-founded semantics. That is, we assume that for each fixed truth assignment for the probabilistic facts, the resulting normal logic program is interpreted through the well-founded semantics. We derive results concerning the complex...
متن کاملPossible Worlds Semantics for Probabilistic Logic Programs
In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logic Programs (p-programs) of Ng and Subrahmanian. Pprograms represent imprecision using probability intervals. Our semantics, based on the possible worlds semantics, considers all point probability distributions that satisfy a gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016